GPU-Based Hierarchical Texture Decompression

نویسندگان

  • Jerzy Stachera
  • Przemyslaw Rokita
چکیده

We propose a hierarchical texture compression algorithm for real-time decompression on the GPU. Our algorithm is characterized by low computational complexity, random access and hierarchical structure which allow us to access first three levels of encoded mip-map pyramid. The hierarchical texture compression algorithm HiTCg is based on block-wise approach, where each block is subject to local fractal transform.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractal-based hierarchical mip-pyramid texture compression

As the level of realism of computer generated images increases with the number and resolution of textures, we are faced with the problem of limited hardware resources. Additionally, the filtering methods require multiple accesses and extra memory space for the texture representation, thus severely reducing the memory space and bandwidth, the most common example being mip-mapping technique. We p...

متن کامل

Locally-Adaptive Texture Compression

Current schemes for texture compression fail to exploit spatial coherence in an adaptive manner due to the strict efficiency constraints imposed by GPU-based, fragment-level decompression. In this paper we present a texture compression framework for quasi-lossless, locally-adaptive compression of graphics data. Key elements include a Hilbert scan to maximize spatial coherence, efficient encodin...

متن کامل

Efficient GPU-based Decompression of BTF Data Compressed using Multi-Level Vector Quantization

One of the main drawbacks of Bidirectional Texture Function (BTF), as a method of capturing realistic and accurate real-world material appearance, is the resulting size of the measured data set. Several lossy methods to compress the data were proposed over the years to cope with this problem. To efficiently use the compressed data an appropriate decompression algorithms are also needed, allowin...

متن کامل

Vector Texture Maps on the GPU ALICE-TR-05-003

This paper presents VTMs (Vector Texture Maps), a novel representation of vector images that can be used as a texture by the GPU for real-time rendering. A VTM decomposes texture space into different regions, represented in an analytic way, by a set of implicit degree 3 polynomials. Each region can be rendered by a different fragment shading function. Accurate anti-aliasing is performed in real...

متن کامل

Vector Texture Maps on the GPU

This paper presents VTMs (Vector Texture Maps), a novel representation of vector images that can be used as a texture by the GPU for real-time rendering. A VTM decomposes texture space into different regions, represented in an analytic way, by a set of implicit degree 3 polynomials. Each region can be rendered by a different fragment shading function. Accurate anti-aliasing is performed in real...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006